Solving Triangular Systems More Accurately and Efficiently
نویسندگان
چکیده
We present a new algorithm that solves linear triangular systems accurately and efficiently. By accurately, we mean that this algorithm should yield a solution as accurate as the one computed in twice the working precision. By efficiently, we mean that its implementation should run faster than the corresponding XBLAS routine with the same output accuracy.
منابع مشابه
Solving Second Kind Volterra-Fredholm Integral Equations by Using Triangular Functions (TF) and Dynamical Systems
The method of triangular functions (TF) could be a generalization form of the functions of block-pulse (Bp). The solution of second kind integral equations by using the concept of TF would lead to a nonlinear equations system. In this article, the obtained nonlinear system has been solved as a dynamical system. The solution of the obtained nonlinear system by the dynamical system throug...
متن کاملDECOMPOSITION METHOD FOR SOLVING FULLY FUZZY LINEAR SYSTEMS
In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.
متن کاملSolving matrix games with hesitant fuzzy pay-offs
The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...
متن کاملEncoding LDPC Codes Using the Triangular Factorization
An algorithm for encoding low-density parity check (LDPC) codes is investigated. The algorithm computes parity check symbols by solving a set of sparse equations, and the triangular factorization is employed to solve the equations efficiently. It is shown analytically and experimentally that the proposed algorithm is more efficient than the Richardson’s encoding algorithm if the code has a smal...
متن کاملUsing Gröbner bases to generate efficient kinematic solutions for the dynamic simulation of multi-loop mechanisms
Article history: Received 1 September 2011 Received in revised form 15 January 2012 Accepted 21 January 2012 Available online 23 February 2012 Manymechanical systems of practical interest contain closed kinematic chains, and aremost conveniently modeled using a set of redundant generalized coordinates. The governing dynamic equations for systems with more coordinates than degrees-of-freedom are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005